UNIMOK: A System for Combining Equational Unification Algorithm

نویسندگان

  • Stephan Kepser
  • Jörn Richts
چکیده

Equational unification algorithms can be used in resolution based theorem provers [9] and rewriting engines [6] to improve their handling of equality. Originally, the requirements of these theorem provers and rewrite engines were such that the unification algorithms had to compute complete sets of unifiers. But with the advent of constraint based approaches to theorem proving [4] and rewriting [8] the interest in unification algorithm that worked merely as decision procedures grew because minimal complete sets of unifiers can be very large – e.g., doubly exponential in the number of variables of the problem in the case of the theory AC – and are hence costly to compute. Because actual unification problems usually contain function symbols from several different signatures, the following combination problem is an important task in unification theory: Given unification algorithms for equational theories E1, E2, . . . , En over pairwise disjoint signatures, provide a general method that gives a unification algorithm for the union E1 ∪ E2 ∪ . . . ∪ En of these theories. Solutions for this problem were provided by Schmidt-Schauß [10] and Boudet [3] for the combination of algorithms calculating complete sets of unifiers and by Baader and Schulz [1] for combining decision procedures. The combination algorithm presented in [1] is mostly of theoretical interest, it contains many non-deterministic decisions, thus the search space that this algorithm spans is so huge, that it is unusable for practical implementations. Therefore the authors developed optimisation methods [7] for the combination algorithm by Baader and Schulz to gain an implementation that can be used in practise. This implementation is UniMoK. UniMoK stands for Unification Module for Keim. It contains algorithms for unification in certain equational theories and it provides several combination methods for them. All combination algorithms in UniMoK are extensions and optimisations of the combination method by Baader and Schulz [1].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Completion for Unification

Unification in equational theories [33] is at the very heart of theorem proving [25] and logic programming [S] but has the main drawback of being undecidable [30]. One is thus in a situation to find specific unification algorithms for equational theories of interest: major examples are the empty theory (no axioms) [lo, 271, associative commutative theories [29, 191 and associativity theory [22,...

متن کامل

Type Inference for Units of Measure

Units of measure are an example of a type system extension involving a nontrivial equational theory. Type inference for such an extension requires equational unification. This complicates the generalisation step required for let-polymorphism in ML-style languages, as variable occurrence does not imply dependency. Previous work on units of measure (by Kennedy in particular) integrated free abeli...

متن کامل

Implementing a Unification Algorithm for Protocol Analysis with XOR

Unification algorithms are central components in constraint solving procedures for security protocol analysis. For the analysis of security protocols with XOR a unification algorithm for an equational theory including ACUN is required. While such an algorithm can easily be obtained using general combination methods such methods do not yield practical unification algorithms. In this work, we pre...

متن کامل

Unification and Anti-unification modulo Equational Theories

Automated reasoning modulo an equational theory E is a fundamental technique in many applications. If E can be split as a disjoint union R ∪ Ax in such a way that R is a set of rewrite rules that are confluent, terminating, sort-decreasing, and coherent modulo a set of equational axioms Ax, it is well-known that narrowing with R modulo Ax provides a complete E-unification algorithm. However, na...

متن کامل

Hierarchical Combination of Unification

A critical question in unification theory is how to obtain a unification algorithm for the combination of non-disjoint equational theories when there exists unification algorithms for the constituent theories. The problem is known to be difficult and can easily be seen to be undecidable in the general case. Therefore, previous work has focused on identifying specific conditions and methods in w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999